A Fast Algorithm With Less Operations for Length-N=q×2m DFTs
نویسندگان
چکیده
Discrete Fourier transform (DFT) is widely used in almost all fields of science and engineering. Fast Fourier transform (FFT) is an efficient tool for computing DFT. In this paper, we present a fast Fourier transform (FFT) algorithm for computing length-q × 2 DFTs. The algorithm transforms all q-points sub-DFTs into three parts. In the second part the operations of sub-transformation contain only multiplications by real constant factors. By transformation, length-2 scaled DFTs (SDFT) are obtained. An extension of scaled radix-2/8 FFT (SR28FFT) is presented for computing these SDFTs, in which, the real constant factors of SDFTs are attached to the coefficients of sub-DFTs to simplify multiplication operations. The proposed algorithm achieves reduction of arithmetic complexity over the related algorithms. It can achieve a further reduction of arithmetic complexity for computing a length-N=q×2 IDFT by 2N−4m real multiplications. In addition, the proposed algorithm is applied to real-data FFT, and is extended to 6 DFTs.
منابع مشابه
A Fast Algorithm Based on SRFFT for Length N = q × 2 m DFTs
In this brief, we present a fast algorithm for computing length-q × 2 discrete Fourier transforms (DFT). The algorithm divides a DFT of size-N = q × 2 decimation in frequency into one length-N/2 DFT and two length-N/4 DFTs. The length-N/2 sub-DFT is recursively decomposed decimation in frequency, and the two size-N/4 sub-DFTs are transformed into two dimension and the terms with the same rotati...
متن کاملDatapath-regular implementation and scaled technique for N=3×2m DFTs
Discrete Fourier transform (DFT) is used widely in almost all fields of science and engineering, and is generally calculated using the fast Fourier transform (FFT) algorithm. In this paper, we present a fast algorithm for efficiently computing a DFT of size 3 2. The proposed algorithm decomposes the DFT, obtaining one length-2 unscaled sub-DFT and two length-2 sub-DFTs scaled by constant real n...
متن کاملA Fast Algorithm With Less Operations for Length- DFTs
Discrete Fourier transform (DFT) is widely used in almost all fields of science and engineering. Fast Fourier transform (FFT) is an efficient tool for computing DFT. In this paper, we present a fast Fourier transform (FFT) algorithm for computing lengthDFTs. The algorithm transforms all -points subDFTs into three parts. In the second part, the operations of subtransformation contain only multip...
متن کاملUnified architecture for 2, 3, 4, 5, and 7-point DFTs based on Winograd Fourier transform algorithm
In this letter, a unified hardware architecture that can be reconfigured to calculate 2, 3, 4, 5, or 7-point DFTs is presented. The architecture is based on the Winograd Fourier transform algorithm (WFTA) and the complexity is equal to a 7-point DFT in terms of adders/subtracters and multipliers plus only seven multiplexers introduced to enable reconfigurability. The processing element finds po...
متن کاملOn Fast Algorithm for Computing Even-Length DCT
We study recursive algorithm for computing DCT of lengths N = q 2m (m, q ∈ N, q is odd) due to C. W. Kok [16]. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor decomposition, when m 6 2. We also show that C. W. Kok’s factorization allows a simple conversion to a scaled form. We analyze complexity of such a scaled factorization, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Signal Processing
دوره 63 شماره
صفحات -
تاریخ انتشار 2015